Veriiable Secret-ballot Elections Veriiable Secret-ballot Elections
نویسنده
چکیده
Veri able Secret-Ballot Elections Josh Daniel Cohen Benaloh
منابع مشابه
Secret Ballot Elections with Unconditional Integrity
This paper presents a voting scheme that allows voters to verify that their vote is accurately included in the count, whilst maintaining ballot secrecy and coercion resistance. It also presents a rigorously defined set of requirements for secret ballot voting, and proofs that the scheme satisfies these requirements.
متن کاملMulti-Autority Secret-Ballot Elections with Linear Work
We present new cryptographic protocols for multi-authority secret ballot elections that guarantee privacy, robustness, and universal verifiability. Application of some novel techniques, in particular the construction of witness hiding/indistinguishable protocols from Cramer, Damg̊ard and Schoenmakers, and the verifiable secret sharing scheme of Pedersen, reduce the work required by the voter or ...
متن کاملAperio: High Integrity Elections for Developing Countries
This article presents an ‘end-to-end’ integrity verification mechanism for use in minimally equipped secret paper-ballot election environments. The scheme presented in this paper achieves high integrity properties without interfering with the traditional marking and tabulation procedures of paper-ballot elections. Officials and auditors can respectively generate and independently verify ‘end-to...
متن کاملIncumbency preservation through electoral legislation: The case of the secret ballot
The secret ballot was designed to eliminate the incentive for candidates to purchase votes through direct vote buying. When voters have private information on their candidate preferences, incumbent candidates will generally be less efficient in purchasing votes than their challengers. Incumbent candidates may therefore benefit from the elimination of direct vote purchasing. Viewed in this vein,...
متن کاملElections Are Conceptually Trivial
After everyone has voted, the votes in each ballot position are counted, and the winner of each race is declared. Barring the use of some form of ranked-preference ballot, the algorithms required are hardly more than mere summations. What makes elections difficult is the problem of performing this summation over a canvassing hierarchy spanning many polling places and local election offices, whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016